A New Signature Scheme Without Random Oracles from Bilinear Pairings
نویسندگان
چکیده
In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of the proposed scheme depends on a new complexity assumption called the k+1 square roots assumption. Moreover, the k+1 square roots assumption can be used to construct shorter signatures under the random oracle model.
منابع مشابه
Yet Another Short Signatures Without Random Oracles from Bilinear Pairings
In recent years, cryptographic protocols based on the bilinear pairings have attracted much attention. One of the most distinguished achievements in this area was the solution to design short signatures. Up to now, there exist two short signature schemes with random oracles and one without random oracles from bilinear pairings. In this paper, we describe another short signature scheme which is ...
متن کاملA New Short Signature Scheme Without Random Oracles from Bilinear Pairings
To date, there exist three short signature schemes from bilinear pairings. In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of our scheme depends on a new complexity assumption called the k+1 square roots assumption. We also discuss the relationship between the k+1 square roots assumption and som...
متن کاملAn Efficient Verifiably Encrypted Signature Scheme without Random Oracles
In this paper, we propose an efficient verifiably encrypted signature scheme based on bilinear pairings. The proposed scheme is proven secure without random oracles. Our scheme has a tight security reduction to a strong but reasonable computational assumption. To the best of our knowledge, it is the third one of this kind in the literature to achieve this security level.
متن کاملEfficient Ring Signatures Without Random Oracles
We describe the first efficient ring signature scheme secure, without random oracles, basedon standard assumptions. Our ring signatures are based in bilinear groups. For l members ofa ring our signatures consist of 2l + 2 group elements and require 2l + 3 pairings to verify. Weprove our scheme secure in the strongest security model proposed by Bender, Katz, and Morselli:namely, ...
متن کاملEfficient Strongly Unforgeable ID-Based Signature Without Random Oracles
Abstract.Up to date, a large number of ID-based signature (IBS) schemes based on bilinear pairings have been proposed. Most of these IBS schemes possess existential unforgeability under adaptive chosen-message attacks, among which some offer strong unforgeability. An IBS scheme is said to be strongly unforgeable if it possesses existential unforgeability and an adversary who is given signatures...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006